#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T> using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x) & (-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()

void solve() {
    int n;
    cin >> n;

    int t1 = 0, t2 = 0;
    V<char> s;

    multiset<int> val;
    val.insert(0);

    while (n--) {

        int op;
        char c;
        cin >> op;
        if (op == 1) {
            cin >> c;
            s.eb(c);
            if (c == '(')
                t1++;
            else
                t2++;
            val.insert(t1 - t2);
            if (*val.begin() < 0) {
                No;
            } else if (t1 == t2) {
                Yes;
            } else {
                No;
            }
        } else {
            char c = s.back();
            s.pop_back();
            val.erase(val.find(t1 - t2));
            if (c == '(')
                t1--;
            else
                t2--;
            if (val.empty()) {
                Yes;
            } else {
                if (*val.begin() < 0) {
                    No;
                } else if (t1 == t2) {
                    Yes;
                } else {
                    No;
                }
            }
        }
    }
}

signed main() {
    int Task = 1;

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    while (Task--) {
        solve();
    }

    return 0;
}